intersection node

См. также в других словарях:

• node — (n.) early 15c., a knot or lump, from L. nodus knot (see NET (Cf. net) (n.)). Originally borrowed c.1400 in Latin form, meaning lump in the flesh. Meaning point of intersection (originally of planetary orbits with the ecliptic) first recorded… …   Etymology dictionary

• Node — In general, a node is a localised swelling (a knot ) or a point of intersection (a vertex). Node may refer to: In mathematics Node (autonomous system), behaviour for an ordinary differential equation near a critical point Node (graph theory), a… …   Wikipedia

• node — /nohd/, n. 1. a knot, protuberance, or knob. 2. a centering point of component parts. 3. Anat. a knotlike mass of tissue: lymph node. 4. Pathol. circumscribed swelling. 5. Bot. a. a joint in a stem. b. a part of a stem that normally bears a leaf …   Universalium

• node — /noʊd / (say nohd) noun 1. a knot, protuberance, or knob. 2. a complication; difficulty. 3. a centring point of component parts. 4. Botany a. a joint in a stem. b. a part of a stem which normally bears a leaf. 5. Geometry a point on a curve or… …  

• node — noun the node of the branches Syn: junction, intersection, interchange, fork, confluence, convergence, crossing …   Thesaurus of popular words

• node point —    The intersection point on a grid [16] …   Lexicon of Cave and Karst Terminology

• Lunar node — Dragon s Tail redirects here. For the Dragon s Tail stretch of road in North Carolina, see Deals Gap, North Carolina. The lunar nodes are the points where the moon s path in the sky crosses the ecliptic, the sun s path in the sky The lunar nodes… …   Wikipedia

• Orbital node — The ascending node. An orbital node is one of the two points where an orbit crosses a plane of reference to which it is inclined.[1] An orbit which is contained in the plane of reference (called non inclined) has no nodes …   Wikipedia

• Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

• Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… …   Wikipedia

• Pappus configuration — In projective geometry, the Pappus configuration consists of a pair (( A , B , C ), ( D , E , F )) of triplets of points, which pair is located either on a pair of lines or on two sides of a conic section, with a hexagon AECDBF defined on the… …   Wikipedia